The Event Management Problem in a Container Terminal

نویسندگان

  • Lorena Bearzotti
  • Rosa Gonzalez
  • Pablo Miranda
چکیده

The container terminal is a convergence point in the cargo flow, being a focal point for multiple supply chains. The operations performed in a container terminal involve one of the most complex environments within the transport industry. A container terminal plays a critical role in international shipping and is under pressure to cope with increasing container traffic. This paper presents a multiagent model to solve the event management problem; this problem has a number of features which makes the agent a suitable technology to consider applying. The model presented is the basis for developing a tool for the event management process in order to contribute to the reduction of logistics cost and to enhance the competitiveness of the container terminal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Approach for Sequencing Loading and Unloading Operations in the Seaside Area of a Container Terminal

Due to the considerable growth in the worldwide container transportation, optimization of container terminal operations is becoming highly needed to rationalize the use of logistics resources. For this reason, we focus our study on the Quay Crane Scheduling Problem (QCSP), which is a core task of managing maritime container terminals. From this planning problem arise two decisions to be made: T...

متن کامل

Optimal Allocation of Ships to Quay Length in Container Ports

Due to the continuously increasing container trade, many terminals are presently operating at or close to capacity. An efficient terminal is one that facilitates the quick transshipment of containers to and from ships. In this sake, this paper addresses the ship assignments problem at a maritime container terminal, where ships are normally assigned to specific quay cranes until the work is fini...

متن کامل

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

متن کامل

Cost Function Modelling for Semi-automated SC, RTG and Automated and Semi-automated RMG Container Yard Operating Systems

This study analyses the concept of cost functions for semi-automated Straddle Carrier (SC), Rubber Tyred Gantry (RTG) and automated Rail Mounted Gantry (RMG) container yard operating cranes. It develops a generic cost based model for a pair-wise comparison, analysis and evaluation of economic efficiency and effectiveness of container yard equipment to be used for decision-making by terminal pla...

متن کامل

Scheduling in Container Terminals using Network Simplex Algorithm

In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013